﻿#define _CRT_SECURE_NO_WARNINGS 1

//动态规划第十二题前置
//198. 打家劫舍
//https://leetcode.cn/problems/house-robber/description/

class Solution {
public:
    int rob(vector<int>& nums)
    {
        int n = nums.size();
        vector<int> f(n);
        auto g = f;
        f[0] = nums[0];

        for (int i = 1; i < n; i++)
        {
            f[i] = g[i - 1] + nums[i];

            g[i] = max(f[i - 1], g[i - 1]);
        }

        return max(f[n - 1], g[n - 1]);
    }
};